On Dissemination Thresholds in Regular and Irregular Graph Classes
نویسندگان
چکیده
منابع مشابه
On the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملAnalysis of hydrofoil craft in regular and irregular waves
In this article, the most important specifications of hydrofoil floats, i.e. their seakeeping under regular and irregular waves under different encounter angles of wave, has been investigated. Numerical simulation has been done using STAR CCM+ software. Surge, heave, roll and pitch motions are kept free at the same time and their effects on each other are taken into account. USV01 model, whose ...
متن کاملAdded Resistance & Drift Force Analysis in Regular and Irregular Waves
The sea wave causes excess resistance which is out of scope of calm water resistance. The total wave force in horizontal plane is divided into “Added Resistance” and “Drift Force”. In this study, based on Gerritsma and Beuckelman[3] hypothesis a computer program has been developed for calculation of added resistance and drift force at various ship speeds and various head...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملIndependent-Set Reconfiguration Thresholds of Hereditary Graph Classes
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In this paper, rather than asking this question from an algorithmic perspective, we analyze the combinatorial structure behind it. We consider the problem of reco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2009
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-009-9309-0